Experimental Realization of Discrete Fourier Transformation on NMR Quantum Computer
نویسندگان
چکیده
We report experimental implementation of discrete Fourier transformation(DFT) on a nuclear magnetic resonance(NMR) quantum computer. Experimental results agree with theoretical results. Using the pulse sequences we introduced, DFT can be realized on any L-bit quantum number in principle. PACS: 87.70.+c, 03.65.-w keywords: NMR; discrete Fourier tranform; experiment; simulation; Shor’s algorithm
منابع مشابه
Experimental realization of an order-finding algorithm with an NMR quantum computer.
We report the realization of a nuclear magnetic resonance quantum computer which combines the quantum Fourier transform with exponentiated permutations, demonstrating a quantum algorithm for order finding. This algorithm has the same structure as Shor's algorithm and its speed-up over classical algorithms scales exponentially. The implementation uses a particularly well-suited five quantum bit ...
متن کاملImplementation of the quantum Fourier transform.
A quantum Fourier transform (QFT) has been implemented on a three qubit nuclear magnetic resonance (NMR) quantum computer to extract the periodicity of an input state. Implementation of a QFT provides a first step towards the realization of Shor's factoring and other quantum algorithms. The experimental implementation of the QFT on a periodic state is presented along with a quantitative measure...
متن کاملImplementation of conditional phase-shift gate for quantum information processing by NMR, using transition-selective pulses.
Experimental realization of quantum information processing in the field of nuclear magnetic resonance (NMR) has been well established. Implementation of conditional phase-shift gate has been a significant step, which has lead to realization of important algorithms such as Grover's search algorithm and quantum Fourier transform. This gate has so far been implemented in NMR by using coupling evol...
متن کاملRealization of arbitrary gates in holonomic quantum computation
Among the many proposals for the realization of a quantum computer, holonomic quantum computation is distinguished from the rest as it is geometrical in nature and thus expected to be robust against decoherence. Here we analyze the realization of various quantum gates by solving the inverse problem: Given a unitary matrix, we develop a formalism by which we find loops in the parameter space gen...
متن کاملCSE 599d - Quantum Computing The Quantum Fourier Transform and Jordan’s Algorithm
There are many motivations for the discrete Fourier transform. Those of you in computer science have probably encountered them first in signal processing and perhaps further in cool theory results like switching lemmas. Those of you in physics have definitely encountered the continuous fourier transform, most likely first in quantum theory where we learn that the fourier transform goes between ...
متن کامل